Mohex Wins 2015 Hex 11×11 and Hex 13×13 Tournaments
نویسندگان
چکیده
DeepHex is a new program based on Sibling Conspiracy Number Search (Pawlewicz and Hayward, 2015a,b). DeepHex, like MoHex, is based on the Benzene framework, developed by Broderick Arneson, Philip Henderson, Ryan Hayward, Aja Huang, and Jakub Pawlewicz. DeepHex ran on a 16 core shared-memory machine. As an opening book, DeepHex cached its evaluation scores in a database, running for 24 hours on each possible opening.
منابع مشابه
Hex 2017: MoHex wins the 11x11 and 13x13 tournaments
The 2017 Olympiad in Leiden hosted two Hex tournaments, board sizes 11×11 and 13×13. Three programs competed in each tournament. These are at present the only annual computer Hex tournaments. 11×11 is the original board size introduced by Piet Hein in 1942. Recently, all 1-move openings on 9×9Hex have been solved by computers, as have two 10×10 openings [9]. So, in recent years the 13×13 compet...
متن کاملMoHex 2.0: A Pattern-Based MCTS Hex Player
In recent years the Monte Carlo tree search revolution has spread from computer Go to many areas, including computer Hex. MCTS Hex players now outperform traditional knowledge-based alpha-beta search players, and the reigning Computer Olympiad Hex gold medallist is the MCTS player MoHex. In this paper we show how to strengthen MoHex, and observe that — as in computer Go — using learned patterns...
متن کاملMOHEX Wins Hex Tournament
The 2011 Hex competition started on Sunday November 20 and finished on Monday November 21. Three programs competed: PANORAMEX by Fabien Teytaud, Tristan Cazenave, and Nicolas Jouandeau from France; WOLVE by Broderick Arneson, Ryan Hayward, and Philip Henderson from Canada; and MOHEX by Philip Henderson, Broderick Arneson, and Ryan Hayward. This year Aja Huang from Taiwan and Jakub Pawlewicz fro...
متن کاملSibling Conspiracy Number Search
For some two-player games (e.g. Go), no accurate and inexpensive heuristic is known for evaluating leaves of a search tree. For other games (e.g. chess), a heuristic is known (sum of piece values). For other games (e.g. Hex), only a local heuristic — one that compares children reliably, but nonsiblings poorly — is known (cell voltage drop in the Shannon/Anshelevich electric circuit model). In t...
متن کاملNeurohex: A Deep Q-learning Hex Agent
DeepMind’s recent spectacular success in using deep convolutional neural nets and machine learning to build superhuman level agents — e.g. for Atari games via deep Q-learning and for the game of Go via other deep Reinforcement Learning methods — raises many questions, including to what extent these methods will succeed in other domains. In this paper we consider DQL for the game of Hex: after s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- ICGA Journal
دوره 39 شماره
صفحات -
تاریخ انتشار 2017